Hybrid methods for large sparse nonlinear least squares

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Methods for Large, Sparse Nonlinear Least Squares Problems

This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by nite diier-ence approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor metho...

متن کامل

Inexact trust region method for large sparse nonlinear least squares

The main purpose of this paper is to show that linear least squares methods based on bidiagonalization, namely the LSQR algorithm, can be used for generation of trust region path. This property is a basis for an inexact trust region method which uses the LSQR algorithm for direction determination. This method is very efficient for large sparse nonlinear least squares as it is supported by numer...

متن کامل

Parallel Tensor Methods for Nonlinear Equations and Nonlinear Least Squares

We describe the design and computational performance of parallel row-oriented tensor algorithms for the solution of dense systems of nonlinear equations and nonlinear least squares problems on a distributed-memory MIMD multiprocessor. Tensor methods are general purpose methods that base each iteration upon a quadratic model of the nonlinear function, rather than the standard linear model, where...

متن کامل

Enhanced Preconditioners for Large Sparse Least Squares Problems

Solving the normal equation systems arising from least-squares problems can be challenging because these systems are often very ill-conditioned. Though the use of iterative methods is appealing for very large problems of this type, preconditioning remains a stumbling block. In this paper we address this issue and describe a number of precondi-tioning strategies. In particular, we discuss a tech...

متن کامل

Randomized Algorithms for Solving Large Scale Nonlinear Least Squares Problems

This thesis presents key contributions towards devising highly efficient stochastic reconstruction algorithms for solving large scale inverse problems, where a large data set is available and the underlying physical systems is complex, e.g., modeled by partial differential equations (PDEs). We begin by developing stochastic and deterministic dimensionality reduction methods to transform the ori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 1996

ISSN: 0022-3239,1573-2878

DOI: 10.1007/bf02275350